SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

The importance of computing intermodal roundtrips in multimodal guidance systems Daniel Baumann, EPFL - LAVOC Alexandre Torday, EPFL - LAVOC Prof. André-Gilles Dumont, EPFL - LAVOC

Source URL: www.strc.ch

• Edsger W. Dijkstra
• Logistics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Shortest path problem
• Intermodal freight transport
• Transport
• Multimodal transport
• Program optimization
• Intermodal journey planner
• Journey planner

Robust Optimization with Recovery: Application to Shortest Paths and Airline Scheduling Niklaus Eggenberg, Transport and Mobility Laboratory, EPFL Matteo Salani, Transport and Mobility Laboratory, EPFL Michel Bierlaire,

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Mathematics
• Mathematical analysis
• Shortest path problem
• Robust optimization
• Linear programming
• Stochastic optimization
• SAMPL
• Global optimization
• Scenario optimization

Static Traffic Assignment Problem. A comparison between Beckmannand Nesterov & de Palmamodels. Fabian A. Chudak, D-Wave Systems Vania Dos Santos Eleuterio, IFOR ETH Zurich

Source URL: www.strc.ch

• Transport
• Mathematical optimization
• Mathematics
• Business
• Network flow
• Operations research
• Game theory
• Road traffic management
• Route assignment
• John Glen Wardrop
• Flow network
• Convex optimization

List of Publications 2013 Staff : Department :

Source URL: www.eng.nus.edu.sg

• Operations research
• Berth allocation problem
• Aimsun
• Mathematical optimization
• Traffic flow

Laboratory of Advanced Software in Mathematics High-Performance Computing for Graph Analysis and Mathematical Optimization Problem Katsuki FUJISAWA Degree: PhD (Science)(Tokyo Institute of Technology)

Source URL: www.imi.kyushu-u.ac.jp

Identifying and attacking the saddle point problem in high-dimensional non-convex optimization Razvan Pascanu Universit´e de Montr´eal

Source URL: arxiv.org

Can we measure the difficulty of an optimization problem? Tansu Alpcan Tom Everitt

Source URL: tansu.alpcan.org

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre de Bruxelles Brussels, Belgium

Source URL: www.strc.ch

• Computational complexity theory
• Ant colony optimization algorithms
• Mathematics
• Ant
• Systems science
• Travelling salesman problem
• Argentine ant
• Stigmergy
• Pheromone
• Dalle Molle Institute for Artificial Intelligence Research
• Artificial ants
• Swarm intelligence

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm